An associative service mining based on dynamic weight
نویسندگان
چکیده
منابع مشابه
ACNB: Associative Classification Mining Based on Naïve Bayesian Method
Integrating association rule discovery and classification in data mining brings a new approach known as associative classification. Associative classification is a promising approach that often constructs more accurate classification models (classifiers) than the traditional classification approaches such as decision trees and rule induction. In this research, the authors investigate the use of...
متن کاملEnhanced Associative classification based on incremental mining Algorithm (E-ACIM)
Several association classification algorithms have been designed to build efficient and accurate associative classifiers for large data set . Most of classification algorithms are still suffer from the huge number of the generated classification rules which takes efforts to select the best ones in order to construct the classifier. Moreover, When different data operations (adding, deleting, upd...
متن کاملA Dynamic Light-Weight Group Service
The virtual synchrony model for group communication has proven to be a powerful paradigm for building distributed applications. Implementations of virtual synchrony usually require the use of failure detectors and failure recovery protocols. In applications that require the use of a large number of groups, signi cant performance gains can be attained if these groups share the resources required...
متن کاملA Dynamic Fuzzy Expert System Based on Maintenance Indicators for Service Type Selection of Machinery
Due to the multiplicity of standards and complex rules; maintenance, repair and servicing of machinery could be done only by the fully qualified and proficient experts. Since the knowledge of such experts is not available all times, using expert systems can help to improve the maintenance process. To address this need and the uncertainty of the maintenance process indicators, this research prop...
متن کاملAn Associative Dynamic Convex Hull Algorithm
This paper presents a new parallel algorithm for the dynamic convex hull problem. This algorithm is a parallel adaptation of the Jarvis March Algorithm. The computational model selected for this algorithm is the associative computing model (ASC) which supports massive parallelism through the use of data parallelism and constant time associative search and maximum functions. Also, ASC can be sup...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Digital Contents Society
سال: 2016
ISSN: 1598-2009
DOI: 10.9728/dcs.2016.17.5.359